Reliability Model of Consecutive $(2, k)$ -Out-of-( $2, n$ ) :F Systems With Local Load-Sharing
نویسندگان
چکیده
منابع مشابه
Recursive Equations of Reliability for Linear Consecutive - k - out - of - n : F Systems with Sparse
In this paper, some recursive equations of reliability for linear consecutivek -out-ofn : F systems with spares d are introduced. The system of consecutive failures with sparse d is a generalized extension of consecutive-k systems, which was proposed by Zhao et al. (2007) in which the reliability formulas of these systems were presented by using finite Markov Chain imbedding approach. To facili...
متن کاملNumber of Minimal Path Sets in a Consecutive-k-out-of-n: F System
In this paper the combinatorial problem of determining the number of minimal path sets of a consecutive-k-out-of-n: F system is considered. For the cases where k = 2, 3 the explicit formulae are given and for k ≥ 4 a recursive relation is obtained. Direct computation for determining the number of minimal path sets of a consecutive-k-out-of-n: F system for k ≥ 4 remains a difficult task. ...
متن کاملNew Improved Bounds for Reliability of Consecutive-k-out-of-n :f Systems
New bounds are found for the reliability of consecutive-k-out-of-n:F systems with equal component failure probabilities. The expressions involved are simple, thus allowing a direct use in the derivation of theoretical properties. These bounds can also be employed in numerical computations when the value of n or k is so large that the exact calculation of the reliability is not achievable. Compa...
متن کاملAn Efficient Algorithm for Computing the Reliability of Consecutive-k-Out-Of-n: F Systems
Many algorithms for computing the reliability of linear or circular consecutive-k-out-of-n:F systems appeared in this Transactions. The best complexity estimate obtained for solving this problem is O(k log(n/k)) operations in the case of i.i.d. components. Using fast algorithms for computing a selected term of a linear recurrence with constant coefficients, we provide an algorithm having arithm...
متن کاملReliability of 2-Dimensional Consecutive-k-out-of-n:F Systeriis
This paper derives lower & upper reliability bounds for the 2-dimensional consecutive k-out-of-n:F system (Salvia Lasher, 1990) with independent but not necessarily ident i d y distributed components. A Weibull limit theorem is proved for system time-tofailure for i.i.d. components.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2018
ISSN: 2169-3536
DOI: 10.1109/access.2018.2802319